Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

泛代数的二次扩张

在本文中引入了泛代数的二次扩张的概念，解决了ＴＵ－ＥＣ（Ａ）和ＵＴ－ＥＣ（Ａ）的存在、真类和基数问题，范畴ＴＵ－ＥＣ（Ａ）（及ＵＴ－ＥＣ（Ａ）），并得到了有关二次扩张的几个同构定理，还对一点二次扩张作了讨论。     

A parallel inexact newton method for stochastic programs with recourse

A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5.     

Bager第五图的完善

１９８９年发表的Ｂａｇｅｒ第五图，包含关于三角形元素的３５个二次规范画数之间的５１个不等式通过细致的分析，本文给出了其中遗漏的１２个基本不等式     

Boundary G/G Theory and Topological Poisson–Lie Sigma Model

We study a boundary version of the gauged WZW model with a Poisson–Lie group G as the target. The Poisson–Lie structure of G is used to define the Wess–Zumino term of the action on surfaces with boundary. We clarify the relation of the model to the topological Poisson sigma model with the dual Poisson–Lie group G ^* as the target and show that the phase space of the theory on a strip is essentially the Heisenberg double of G introduced by Semenov–Tian–Shansky.     

A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM

ＡＢＲＡＮＣＨＢＯＵＮＤＭＥＴＨＯＤＦＯＲＳＵＢＳＥＴＳＵＭＰＲＯＢＬＥＭＷＵＳＨＩＱＵＡＮ（吴士泉）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，Ｃ...     

Derived Brackets

We survey the many instances of derived bracket construction in differential geometry, Lie algebroid and Courant algebroid theories, and their properties. We recall and compare the constructions of Buttin and of Vinogradov, and we prove that the Vinogradov bracket is the skew-symmetrization of a derived bracket. Odd (resp., even) Poisson brackets on supermanifolds are derived brackets of canonical even (resp., odd) Poisson brackets on their cotangent bundle (resp., parity-reversed cotangent bundle). Lie algebras have analogous properties, and the theory of Lie algebroids unifies the results valid for manifolds on the one hand, and for Lie algebras on the other. We outline the role of derived brackets in the theory of Poisson structures with background'.     

Pauli-Fierz Hamiltonians defined as quadratic forms

We study Pauli-Fierz Hamiltonians-self-adjoint operators describing a small quantum system interacting with a bosonic field. Using quadratic form techniques, we extend the results of Dereziński-Gérard and Gérard about the self-adjointness, the location of the essential spectrum and the existence of a ground state to a large class of Pauli-Fierz Hamiltonians.     

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems. The author thanks the Associate Editor and an anonymous referee for their helpful comments.     

求解P0函数互补问题的一种微分方程方法

本针对P0函数互补问题，给出了一种微方程方法，并且证明了P0函数互补问题的解是微分方程系统的渐进稳定平衡点。在适当的假设条件下，证明了所给出的算法具有二次收敛速度。几个数值例子表明了该算法的有效性。